Alphabetic Flat Splicing Pure Context-free Grammar Systems

In the context of DNA computing, an operation on words, called splicing, was introduced by Head (1987), in his study on recombinant behavior of DNA molecules. Recently, a special kind of splicing, called flat splicing on strings, was considered and several properties were derived. On the other hand, in the study of modelling of distributed complex systems based on language theory, grammar systems were proposed. Here we introduce a grammar system, called alphabetic flat splicing pure context-free grammar system ( ), as a new model of language generation, based on the operation of alphabetic flat splicing on words and pure context-free rules. We derive certain comparison results that bring out the generative power of and as an application construct a generating “floor-design” pictures.